Branch and price
‹The stub template below has been proposed for renaming to . See stub types for deletion to help reach a consensus on what to do.
Feel free to edit the template, but the template must not be blanked, and this notice must not be removed, until the discussion is closed. For more information, read the guide to deletion.›
In applied mathematics, branch and price is a method of combinatorial optimization for solving integer linear programs, (linear programming problems with many integer variables). The method is a hybrid of branch and bound and column generation methods.
Branch and price uses column generation at every node of the branch and bound tree to fathom the value of subproblems.
References
- Branch-and-Price: Column Generation for Solving Huge Integer Programs, Barnhart, Johnson, Nemhauser, Savelsbergh, and Vance, 1996.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Categories (Algorithms · Methods · Heuristics) · Software
|
|